A strongly polynomial algorithm for line search in submodular polyhedra
نویسنده
چکیده
A submodular polyhedron is a polyhedron associated with a submodular function. This paper presents a strongly polynomial time algorithm for line search in submodular polyhedra with the aid of a fully combinatorial algorithm for submodular function minimization. The algorithm is based on the parametric search method proposed by Megiddo.
منابع مشابه
MATHEMATICAL ENGINEERING TECHNICAL REPORTS A Strongly Polynomial Algorithm for Line Search in Submodular Polyhedra
A submodular polyhedron is a polyhedron associated with a submodular function. This paper presents a strongly polynomial time algorithm for line search in submodular polyhedra with the aid of a fully combinatorial algorithm for submodular function minimization as a subroutine. The algorithm is based on the parametric search method proposed by Megiddo.
متن کاملDiscrete Newton's Algorithm for Parametric Submodular Function Minimization
We consider the line search problem in a submodular polytope P (f) ⊆ R: Given an arbitrary a ∈ R and x0 ∈ P (f), compute max{δ : x0 + δa ∈ P (f)}. The use of the discrete Newton’s algorithm for this line search problem is very natural, but no strongly polynomial bound on its number of iterations was known [Iwata, 2008]. We solve this open problem by providing a quadratic bound of n + O(n log n)...
متن کاملBisubmodular Function Minimization
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to Iwata, Fleischer, and Fujishige. Since the rank functions of delta-matroids are bisubmodular, the scaling algorithm naturally leads to the first combinatorial polynomial algorithm for testing membership in delta-matro...
متن کاملStrongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid
We present a new algorithm for the problem of determining the intersection of a half-line Δu = {x ∈ IR | x = λu for λ ≥ 0} with a polymatroid. We then propose a second algorithm which generalizes the first algorithm and solves a parametric linear program. We prove that these two algorithms are strongly polynomial and that their running time is O(n + γn) where γ is the time for an oracle call. T...
متن کاملCSC 5160 : Combinatorial Optimization and Approximation Algorithms
In this lecture, the focus is on submodular function in combinatorial optimizations. The first class of submodular functions which was studied thoroughly was the class of matroid rank functions. The flourishing stage of matroid theory came with Jack Edmonds’ work in 1960s, when he gave a minmax formula and an efficient algorithm to the matroid partition problem, from which the matroid intersect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Optimization
دوره 4 شماره
صفحات -
تاریخ انتشار 2007